A Simplicity Criterion for Finite Groups
نویسندگان
چکیده
منابع مشابه
Abstract simplicity of complete Kac-Moody groups over finite fields
simplicity of complete Kac-Moody groups over finite fields Lisa Carbone Department of Mathematics, Hill Center, Busch Campus, Rutgers, The State University of New Jersey 110 Frelinghuysen Rd Piscataway, NJ 08854-8019 e-mail: [email protected] Mikhail Ershov ∗ School of Mathematics, Institute for Advanced Study 1 Einstein Drive, Princeton, NJ 08540. Current address: University of Virgini...
متن کاملSimplicity of some automorphism groups
a r t i c l e i n f o a b s t r a c t Let M be a countably infinite first order relational structure which is homogeneous in the sense of Fraïssé. We show, under the assumption that the class of finite substructures of M has the free amalgamation property, along with the assumption that Aut(M) is transitive on M but not equal to Sym(M), that Aut(M) is a simple group. This generalises results of...
متن کاملA CRITERION FOR HNN EXTENSIONS OF FINITE p-GROUPS TO BE RESIDUALLY p
We give a criterion for an HNN extension of a finite p-group to be residually p. 1. Statement of the Main Results By an HNN pair we mean a pair (G,φ) where G is a group and φ : A → B is an isomorphism between subgroups A and B of G. Given such an HNN pair (G,φ) we consider the corresponding HNN extension G∗ = 〈G, t | t−1at = φ(a), a ∈ A〉 of G, which we denote, by slight abuse of notation, as G∗...
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1997
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.6869